abstract class $DIGRAPH{NTP} < $RO_DIGRAPH{NTP}
****
A directed graph that permits the addition of new nodes and edges.


Ancestors
$RO_DIGRAPH{_} $GRAPH{_,_} $STR $ELT{_}
$ELT

Descendants
DIGRAPH_REV_DIGRAPH_VIEW{_} DIGRAPH_INCL{_} DIGRAPH_REV_DIGRAPH_VIEW{_,_} DIGRAPH{_}
LBLD_DIGRAPH{_,_,_} WTD_DIGRAPH{_,_} $LBLD_DIGRAPH{_,_,_}



Public


Features
add_node: NTP;
**** Add a new node to the graph. Returns the node index
add_node(n: NTP): NTP;
**** Add the node "n" to the graph. Return a node index. The node index that is returned may be the same as the original node index, if that is appropriate for this graph, or maybe a new object. The user of this function should make no assumption about the relationship between the node that is added and the index that is returned.
connect(e: DIEDGE{NTP});
**** Add the edge "e" which connects the nodes "e.first" to "e.second"
delete_node(n: NTP);
**** Delete the node index "n"
disconnect(e: DIEDGE{NTP});
**** Delete the edge specified by "e". Does nothing if "e" does no exist

The Sather Home Page